Deadlock Control for Weighted Systems of Simple Sequential Processes with Resources Requirement (WS3PR)

نویسنده

  • Daniel Yuh Chao
چکیده

Current deadlock control approaches for WSPR (Weighted Systems of Simple Sequential Processes with Resources Requirement) suffer from incorrect liveness characterization based on the concept of deadly marked siphons (DMS). We discover that nonlive transitions may exist even though there are no DMS. That is, the net model may be weakly live or in livelock states under no DMS. It is live under a new liveness condition: all siphons must be max*-controlled. We extend the liveness analysis for S PR (systems of simple sequential processes with resources) to WS PR (Weighted Systems of Simple Sequential Processes with Resources Requirement). We develop a new liveness condition called max*-controlled siphons to replace that of the absence of empty siphons. We propose further a deadlock control policy for WS PR by adding control nodes and arcs similar to that for S PR.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Liveness of an extended S3PR

Most existing prevention methods tackle the deadlock issue arising in flexible manufacturing systems modeled with Petri nets by adding monitors and arcs. Instead, this paper presents a new one based on a characteristic structure of WS3PR, an extension of System of Simple Sequential Processes with Resources (S3PR) with weighted arcs. The numerical relationships among weights, and between weights...

متن کامل

Deadlock Prevention for Sequence Resource Allocation Systems

This paper presents a deadlock prevention algorithm for the class of sequential resource allocation system for flexible manufacturing systems, which allows for multiple resources flexible routings. Two classes of Petri nets Extended from Systems of Simple Sequential Processes with Resources (ESPR) and Systems of Simple Sequential Processes with General Resource Requirements (SPGR) whose deadloc...

متن کامل

Robustness of deadlock control for a class of Petri nets with unreliable resources

A variety of deadlock control policies based on Petri nets have been proposed for automated manufacturing systems (AMSs). Most of them prevent deadlocks by adding monitors for emptiable siphons that, without an appropriate control policy, can cause deadlocks, where the resources in a system under consideration are assumed to be reliable. When resources are unreliable, it is infeasible or imposs...

متن کامل

Computation of Control Related States of Top Left K-net System (with a Nonsharing Resource Place) of Petri Nets

Earlier, Chao pioneered the very first closed-form solution of the number of reachable and other states for marked graphs (MG) and k-th order system which is the simplest class of SPR (Systems of Simple Sequential Processes with Resources). This paper progresses one step further on enumerating reachable (forbidden, live and deadlock) states for top Left k-net systems (one non-sharing resource p...

متن کامل

A novel method for deadlock prevention of AMS by using resource-oriented Petri nets

Based on the systems of simple sequential processes with resources (S 3 PR) model, the existing methods involve prohibitive computation to synthesize a deadlock prevention controller for automated manufacturing systems (AMS). To reduce the computation, this work studies this problem by using a resource-oriented Petri net (ROPN) model. By revealing the relationship between the bad markings and s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Inf. Sci. Eng.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2009